High-Performance Local Search for Solving Real-Life Inventory Routing Problems
نویسندگان
چکیده
In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a long-term horizon, is a generalization of the vehicle routing problem with vendor managed inventory replenishment. The particularity of this problem is that the vendor monitors the customers’ inventories, deciding when and how much each inventory should be replenished by routing tank trucks. Thus, the objective of the vendor is to minimize the logistic cost of the inventory replenishment for all customers over the long run. Then, an original local-search heuristic is presented for solving the short-term planning problem. The engineering of this algorithm follows the three-layers methodology for “high-performance local search” recently introduced by some of the authors. A computational study demonstrates that our solution is both effective, efficient and robust, providing long-term savings exceeding 20 % on average, compared to solutions computed by expert planners or even a classical greedy algorithm. The resulting software is now exploited in North America by one of the French industry leaders. 1 Presentation of the problem The problem addressed in this paper is a real-life inventory routing problem (IRP) occurring in one of the world’s leading companies in its field. For the sake of concision, the problem is not completely and formally described here, but its main characteristics are outlined. Spread over a geographical area, some customers consume fluid products and plants produce it. Each customer is equipped with a storage; similarly, each plant has a storage from which product can be pumped. Reliable forecasts of production at plants are known over a short-term horizon. On the customer side, two kinds of resupply are managed by the vendor. The first one, called “forecasting-based resupply”, corresponds to clients for which reliable forecasts of consumption are available over a short-term horizon. The inventory of each customer must be replenished by tank trucks so as to never fall under its safety
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملLocal search for mixed-integer nonlinear optimization: methodology and applications
Local search [1] is a practical solution approach for tackling large-scale discrete optimization problems, particularly whose arising in real-life applications. The authors have designed a methodology [5] for designing and engineering high-performance local-search heuristics in such contexts. This methodology has been shown to be successful for solving various industrial problems; several of th...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کامل